73 research outputs found

    Isotropic Surface Remeshing

    Get PDF
    International audienceThis paper proposes a new method for isotropic remeshing of tri- angulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we first distribute the desired number of samples by generalizing error diffusion, commonly used in image halftoning, to work directly on mesh triangles and feature edges. We then use the resulting sam- pling as an initial configuration for building a weighted centroidal Voronoi tessellation in a conformal parameter space, where the specified density function is used for weighting. We finally create the mesh by lifting the corresponding constrained Delaunay trian- gulation from parameter space. A precise control over the sampling is obtained through a flexible design of the density function, the latter being possibly low-pass filtered to obtain a smoother grada- tion. We demonstrate the versatility of our approach through vari- ous remeshing examples

    Irreducible triangulations of surfaces with boundary

    Get PDF
    A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g>=0 with b>=0 boundaries is O(g+b). So far, the result was known only for surfaces without boundary (b=0). While our technique yields a worse constant in the O(.) notation, the present proof is elementary, and simpler than the previous ones in the case of surfaces without boundary

    Computational topology of graphs on surfaces

    No full text
    International audienc

    ALGORITHMS FOR GRAPHS ON SURFACES

    No full text

    Computational topology of graphs on surfaces

    No full text
    International audienc
    corecore